Daycare Matching in Japan: Transfers and Siblings

In this paper, we study a daycare matching problem in Japan and report the design implementation of new centralized algorithm, which is going to be deployed one municipality Tokyo metropolis. There are two features that make market different from classical hospital-doctor problem: i) some children initially enrolled prefer transferred other centers; ii) family may associated with or more allowed submit preferences over combinations centers. We revisit well-studied properties including individual rationality, non-wastefulness, as well stability, generalize them setting. an algorithm based on integer programming (IP) captures these conduct experiments five real-life data sets provided by three municipalities. Experimental results show our performs at least currently used methods terms numbers matched blocking coalition; can find stable outcome for all instances, although existence such not guaranteed theory.